Some Involutions which Generate the Finite Symmetric Group
نویسندگان
چکیده
منابع مشابه
The Bruhat Order on the Involutions of the Symmetric Group
In this paper we study the partially ordered set of the involutions of the symmetric group Sn with the order induced by the Bruhat order of Sn . We prove that this is a graded poset, with rank function given by the average of the number of inversions and the number of excedances, and that it is lexicographically shellable, hence Cohen-Macaulay, and Eulerian.
متن کاملWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملOn Some (Pseudo) Involutions in the Riordan Group
In this paper, we address a question posed by L. Shapiro regarding algebraic and/or combinatorial characterizations of the elements of order 2 in the Riordan group. We present two classes of combinatorial matrices having pseudo-order 2. In one class, we find generalizations of Pascal’s triangle and use some special cases to discover and prove interesting identities. In the other class, we find ...
متن کاملFamilies of Vector Fields which Generate the Group of Diffeomorphisms
Given a compact manifold M , we prove that any bracket generating and invariant under multiplication on smooth functions family of vector fields on M generates the connected component of unit of the group DiffM . Let M be a smooth n-dimensional compact manifold, VecM the space of smooth vector fields on M and Diff0M the group of isotopic to the identity diffeomorphisms of M . Given f ∈ VecM , w...
متن کاملSets of permutations that generate the symmetric group pairwise
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Sciences and Applications E-Notes
سال: 2020
ISSN: 2147-6268
DOI: 10.36753/mathenot.608443